Observable liveness of Petri nets with controllable and observable transitions
نویسندگان
چکیده
منابع مشابه
Observable Liveness
Abstract. Whereas the traditional liveness property for Petri nets guarantees that each transition can always occur again, observable liveness requires that, from any reachable marking, each observable transition can be forced to fire by choosing appropriate controllable transitions; hence it is defined for Petri nets with distinguished observable and controllable transitions. We introduce obse...
متن کاملTiming and liveness in continuous Petri nets
Fluidification constitutes a relaxation technique for studying discrete event systems through fluidified approximated models, thus avoiding the state explosion problem. Moreover, the class of continuous models thus obtained may be interesting in itself. In Petri nets, fluidification leads to the so called continuous Petri nets, that are technically hybrid models. Under infinite server semantics...
متن کاملDeciding Structural Liveness of Petri Nets
Place/transition Petri nets are a standard model for a class of distributed systems whose reachability spaces might be infinite. One of well-studied topics is the verification of safety and liveness properties in this model; despite the extensive research effort, some basic problems remain open, which is exemplified by the open complexity status of the reachability problem. The liveness problem...
متن کاملLiveness, Fairness, and Recurrence in Petri Nets
In Petri net theory, a transition is called live if from every reachable marking there starts a computation in which the transition occurs. Another important property of a transition is the recurrent occurrence of the transition in every computation. In that case, we call the transition recurrent. Though liveness and recurrence of a transition are similar in spirit, there is a big di erence: Li...
متن کاملBounding the Distance of a Controllable and Observable
Let (A;B;C) be a triple of matrices representing a time-invariant linear system _ x(t) = Ax(t) +Bu(t) y(t) = Cx(t) under similarity equivalence, corresponding to a realization of a prescribed transfer function matrix. In this paper we measure the distance between a irreducible realization, that is to say a controllable and observable triple of matrices (A;B;C) and the nearest reducible one that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science China Information Sciences
سال: 2017
ISSN: 1674-733X,1869-1919
DOI: 10.1007/s11432-016-0241-y